Near G-optimal Tchakaloff designs
نویسندگان
چکیده
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملOptimal polynomial meshes and Caratheodory-Tchakaloff submeshes on the sphere
Using the notion of Dubiner distance, we give an elementary proof of the fact that good covering point configurations on the 2-sphere are optimal polynomial meshes. From these we extract CaratheodoryTchakaloff (CATCH) submeshes for compressed Least Squares fitting. 2010 AMS subject classification: 41A10, 65D32.
متن کاملSimulated annealing for near-optimal dual-channel mi- croarray designs
Dual-channel microarray experiments can be regarded as designs with block-size two. Our aim is to find D-optimal, A-optimal and related L-optimal designs for such experiments. Previous work has focussed on exhaustive search algorithms, which in many practical, large-scale experiments is infeasible. We propose using simulated annealing to search for near-optimal designs. We also consider a sub-c...
متن کاملErgastulum: quickly finding near-optimal storage system designs
The cost of large storage systems is dominated by management costs. Typically, skilled administrators configure storage manually using rules of thumb. However, designing a storage system for a given workload is a difficult task, because there are millions of possible configurations and mappings of data, and because storage system behavior is complex. Ergastulum is a new storage system designer ...
متن کاملCaratheodory-Tchakaloff Subsampling
We present a brief survey on the compression of discrete measures by Caratheodory-Tchakaloff Subsampling, its implementation by Linear or Quadratic Programming and the application to multivariate polynomial Least Squares. We also give an algorithm that computes the corresponding CaratheodoryTchakaloff (CATCH) points and weights for polynomial spaces on compact sets and manifolds in 2D and 3D. 2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Statistics
سال: 2019
ISSN: 0943-4062,1613-9658
DOI: 10.1007/s00180-019-00933-8